Spectral Animation Compression

This paper presents a spectral approach to compress dynamic animation consisting of a sequence of homeomor-phic manifold meshes. Our new approach directly compresses the field of deformation gradient d...     

Evolutionary collective behavior decomposition model for time series data mining

In this research, we propose a novel framework referred to as collective game behavior decomposition where complex collective behavior is assumed to be generated by aggregation of several groups of agents following different strategies and complexity emerges from collaboration and competition of individuals. The strategy of an agent is modeled by certain simple game theory models with limited information. Genetic algorithms are used to obtain the optimal collective behavior decomposition based on history data. The trained model can be used for collective behavior prediction. For modeling individual behavior, two simple games, the minority game and mixed game are investigated in experiments on the real-world stock prices and foreign-exchange rate. Experimental results are presented to show the effectiveness of the new proposed model.     

Human mobility synthesis using matrix and tensor factorizations

Human mobility prediction is of great advantage in route planning and schedule management. However, mobility data is a high-dimensional dataset in which multi-context prediction is difficult in a single model. Mobility data can usually be expressed as a home event, a work event, a shopping event and a traveling event. Previous works have only been able to learn and predict one type of mobility event and then integrate them. As the tensor model has a strong ability to describe high-dimensional information, we propose an algorithm to predict human mobility in tensors of location context data. Using the tensor decomposition method, we extract human mobility patterns with multiple expressions and then synthesize the future mobility event based on mobility patterns. The experiment is based on real-world location data and the results show that the tensor decomposition method has the highest accuracy in terms of prediction error among the three methods. The results also prove the feasibility of our multi-context prediction model.     

Data-driven model reduction-based nonlinear MPC for large-scale distributed parameter systems

Model predictive control (MPC) has been effectively applied in process industries since the 1990s. Models in the form of closed equation sets are normally needed for MPC, but it is often difficult to obtain such formulations for large nonlinear systems. To extend nonlinear MPC (NMPC) application to nonlinear distributed parameter systems (DPS) with unknown dynamics, a data-driven model reduction-based approach is followed. The proper orthogonal decomposition (POD) method is first applied off-line to compute a set of basis functions. Then a series of artificial neural networks (ANNs) are trained to effectively compute POD time coefficients. NMPC, using sequential quadratic programming is then applied. The novelty of our methodology lies in the application of POD's highly efficient linear decomposition for the consequent conversion of any distributed multi-dimensional space-state model to a reduced 1-dimensional model, dependent only on time, which can be handled effectively as a black-box through ANNs. Hence we construct a paradigm, which allows the application of NMPC to complex nonlinear high-dimensional systems, even input/output systems, handled by black-box solvers, with significant computational efficiency. This paradigm combines elements of gain scheduling, NMPC, model reduction and ANN for effective control of nonlinear DPS. The stabilization/destabilization of a tubular reactor with recycle is used as an illustrative example to demonstrate the efficiency of our methodology. Case studies with inequality constraints are also presented.     

Trajectory-Shaping Guidance with final speed and load factor constraints

This paper describes the design of a guidance law used for guiding a hypersonic gliding vehicle against a ground target from a near-vertical orientation with a specified final speed and a near-zero final load factor. The guidance law consists of two terms: one is Trajectory-Shaping Guidance (TSG) used for steering the vehicle to the target from the specified orientation; the other is Final-Speed-Control Scheme (FSCS) used for controlling the vehicle to perform lateral maneuver to adjust the final speed. Further, the generalized closed form solutions of TSG are obtained from a more general linearized engagement model, where the speed of the vehicle can be an arbitrary positive function of time. By analyzing these solutions, the stability domain of the guidance coefficients is obtained such that the final load factor is zero. This domain is not affected by the change rate of the speed. Thus, according to this analysis, the proposed guidance law can achieve a near zero final load factor by properly selecting the guidance coefficients in the stability domain.     

Supply chain planning and scheduling integration using Lagrangian decomposition in a knowledge management environment

The integration of planning and scheduling decisions in rigorous mathematical models usually results in large scale problems. In order to tackle the problem complexity, decomposition techniques based on duality and information flows between a master and a set of subproblems are widely applied. In this sense, ontologies improve information sharing and communication in enterprises and can even represent holistic mathematical models facilitating the use of analytic tools and providing higher flexibility for model building. In this work, we exploit this ontologies’ capability to address the optimal integration of planning and scheduling using a Lagrangian decomposition approach. Scheduling/planning sub-problems are created for each facility/supply chain entity and their dual solution information is shared by means of the ontological framework. Two case studies based on a STN representation of supply chain planning and scheduling models are presented to emphasize the advantages and limitations of the proposed approach.     

The Investigation of the Fractional-View Dynamics of Helmholtz Equations Within Caputo Operator

It is eminent that partial differential equations are extensively meaningful in physics, mathematics and engineering. Natural phenomena are formulated with partial differential equations and are solved analytically or numerically to interrogate the system’s dynamical behavior. In the present research, mathematical modeling is extended and the modeling solutions Helmholtz equations are discussed in the fractional view of derivatives. First, the Helmholtz equations are presented in Caputo’s fractional derivative. Then Natural transformation, along with the decomposition method, is used to attain the series form solutions of the suggested problems. For justification of the proposed technique, it is applied to several numerical examples. The graphical representation of the solutions shows that the suggested technique is an accurate and effective technique with a high convergence rate than other methods. The less calculation and higher rate of convergence have confirmed the present technique’s reliability and applicability to solve partial differential equations and their systems in a fractional framework.     

The constrained two-dimensional guillotine cutting problem with defects: an ILP formulation,a Benders decomposition and a CP-based algorithm

This paper addresses a variant of two-dimensional cutting problems in which rectangular small pieces are obtained by cutting a rectangular object through guillotine cuts. The characteristics of this variant are (i) the object contains some defects, and the items cut must be defective-free; (ii) there is an upper bound on the number of times an item type may appear in the cutting pattern; (iii) the number of guillotine stages is not restricted. This problem commonly arises in industrial settings that deal with defective materials, e.g. either by intrinsic characteristics of the object as in the cutting of wooden boards with knotholes in the wood industry, or by the manufacturing process as in the production of flat glass in the glass industry. We propose a compact integer linear programming (ILP) model for this problem based on the discretisation of the defective object. As solution methods for the problem, we develop a Benders decomposition algorithm and a constraint-programming (CP) based algorithm. We evaluate these approaches through computational experiments, using benchmark instances from the literature. The results show that the methods are effective on different types of instances and can find optimal solutions even for instances with dimensions close to real-size.     

Model reduction for nonlinear multiscale parabolic problems using dynamic mode decomposition

In this article, a model reduction technique is presented to solve nonlinear multiscale parabolic problems using dynamic mode decomposition. The multiple scales and nonlinearity bring great challenges for simulating the problems. To overcome this difficulty, we develop a model reduction method for the nonlinear multiscale dynamic problems by integrating constraint energy minimizing generalized multiscale finite element method (CEM-GMsFEM) with dynamic mode decomposition (DMD). CEM-GMsFEM has shown great efficiency to solve linear multiscale problems in a coarse space. However, using CEM-GMsFEM to directly solve multiscale nonlinear parabolic models involves dynamically computing the residual and the Jacobian on a fine grid. This may be very computationally expensive because the evaluation of the nonlinear term is implemented in a high-dimensional fine scale space. As a data-driven method, DMD can use observation data and give an explicit expression to accurately describe the underlying nonlinear dynamic system. To efficiently compute the multiscale nonlinear parabolic problems, we propose a CEM-DMD model reduction by combing CEM-GMsFEM and DMD. The CEM-DMD reduced model is a coarsen linear model, which avoids the nonlinear solver in the fine space. It is crucial to judiciously choose observation in DMD. Only proper observation can render an accurate DMD model. In the context of CEM-DMD, we introduce two different observations: fine scale observation and coarse scale observation. In the construction of DMD model, the coarse scale observation requires much less computation than the fine scale observation. The CEM-DMD model using the coarse scale observation gives a complete coarse model for the nonlinear multiscale dynamic systems and significantly improves the computation efficiency. To show the performance of the CEM-DMD using the different observations, we present a few numerical results for the nonlinear multiscale parabolic problems in heterogeneous porous media.     

基于VMD与时间序列分析的滚动轴承故障特征提取方法

为了在非线性、非平稳的滚动轴承故障振动信号中有效提取出敏感的故障特征,提出了基于变分模态分解(VMD)与时间序列分析相结合的特征提取方法。首先通过VMD将原始信号分解为不同预设尺度的本征模态分量(IMF),对各个IMF分量建立时间序列预测模型,通过叠加重构得到最终的预测模型,比较评价指标确定最优参数的选取。最后,通过仿真信号与滚动轴承实际故障数据分析,并与经验模式分解(EMD)进行对比,结果表明该方法能够有效的提取到故障特征频率。